package com.leetcode.题库.score1;

import java.util.Scanner;

/**
 * @BelongsProject: LeetCode
 * @BelongsPackage: com.leetcode.题库.score1
 * @Author: lei
 * @CreateTime: 2024-03-12  22:11
 * @Description: TODO
 * @Version: 1.0
 */
public class 环中最长子串02 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        while (scanner.hasNextLine()) {
            String s = scanner.nextLine();
            int startIndex = s.indexOf("o");
            if (startIndex == -1) {
                System.out.println(s);
                continue;
            }
            int left = startIndex + 1;
            int right = left + 1;
            while (left < right) {
                String leftStr = String.valueOf(s.charAt(left));
                String rightStr = String.valueOf(s.charAt(right));

            }
        }
    }
}
